What (who) is higher-order function - definition

FUNCTION THAT TAKES ONE OR MORE FUNCTIONS AS AN INPUT OR THAT OUTPUTS A FUNCTION

Higher-order functions; Higher order functions; Higher order function; First order functions; Functional form; Second-order function; First-order function; First order function; Comparison of programming languages (higher-order functions); Function function

higher-order function

(HOF) A function that can take one or more functions as argument and/or return a function as its value. E.g. map in (map f l) which returns the list of results of applying function f to each of the elements of list l. See also curried function.

Fold (higher-order function)

FAMILY OF HIGHER-ORDER FUNCTIONS THAT ANALYZE A RECURSIVE DATA STRUCTURE AND BUILD UP A RETURN VALUE

Foldl; Foldr; Right fold; Left fold; Reduce (higher-order function); Fold function; Fold (higher order function); Accumulate (higher-order function); Fold (function); Reduce function; FoldLeft; FoldRight

In functional programming, fold (also termed reduce, accumulate, aggregate, compress, or inject) refers to a family of higher-order functions that analyze a recursive data structure and through use of a given combining operation, recombine the results of recursively processing its constituent parts, building up a return value. Typically, a fold is presented with a combining function, a top node of a data structure, and possibly some default values to be used under certain conditions.

https://en.wikipedia.org/wiki/Fold_(higher-order_function)

Higher-order thinking

EDUCATION CONCEPT ARGUING THAT SOME TYPES OF LEARNING REQUIRE MORE COGNITIVE PROCESSING BUT ALSO HAVE MORE GENERALIZED BENEFITS

Higher order thinking skills; Higher order thinking; High Order Thinking Skills

Higher-order thinking, known as higher order thinking skills (HOTS), is a concept of education reform based on learning taxonomies (such as Bloom's taxonomy). The idea is that some types of learning require more cognitive processing than others, but also have more generalized benefits.

https://en.wikipedia.org/wiki/Higher-order_thinking

Wikipedia

Higher-order function

In mathematics and computer science, a higher-order function (HOF) is a function that does at least one of the following:

takes one or more functions as arguments (i.e. a procedural parameter, which is a parameter of a procedure that is itself a procedure),
returns a function as its result.

All other functions are first-order functions. In mathematics higher-order functions are also termed operators or functionals. The differential operator in calculus is a common example, since it maps a function to its derivative, also a function. Higher-order functions should not be confused with other uses of the word "functor" throughout mathematics, see Functor (disambiguation).

In the untyped lambda calculus, all functions are higher-order; in a typed lambda calculus, from which most functional programming languages are derived, higher-order functions that take one function as argument are values with types of the form $(\tau _{1}\to \tau _{2})\to \tau _{3}$ .

https://en.wikipedia.org/wiki/Higher-order function